Multi-Prediction Compression: An Efficient and Scalable Memory Compression Framework for GP-GPU

نویسندگان

چکیده

Data-intensive applications and throughput-oriented processors demand more memory bandwidth. Memory compression can provide data beyond physical limits, yet new types smaller block sizes are challenging. This paper presents a novel lightweight framework, Multi-Prediction Compression (MPC), to increase the effective Based on multiple prediction models data-driven algorithm tuning, MPC 31.7% better than state-of-the-art (SOTA) algorithms for 32B blocks. Moreover, is hardware-friendly scalable support growing number of patterns.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Scalable Image Compression Algorithms with Low Memory and Complexity

The set partitioning embedded block (SPECK) image compression algorithm has excellent performance, low computational complexity, and produces a rate scalable compressed bitstream that can be decoded efficiently at multiple bit-rates. Unfortunately, it consumes a huge amount of computer memory due to employing lists that store the coordinates of the image pixels and the coordinates of the sets t...

متن کامل

An Efficient Approach for Multi-Sentence Compression

Multi Sentence Compression (MSC) is of great value to many real world applications, such as guided microblog summarization, opinion summarization and newswire summarization. Recently, word graph-based approaches have been proposed and become popular in MSC. Their key assumption is that redundancy among a set of related sentences provides a reliable way to generate informative and grammatical se...

متن کامل

An Efficient Fine-grain Scalable Compression Scheme for Sparse Data

A fine-grain scalable and efficient compression scheme for sparse data based on adaptive significance-trees is presented. Common approaches for 2-D image compression like EZW (embedded wavelet zero tree) and SPIHT (set partitioning in hierarchical trees) use a fixed significance-tree that captures well the interand intraband correlations of wavelet coefficients. For most 1D signals like audio, ...

متن کامل

Efficient scalable speech compression for scalable speech recognition

We propose a scalable recognition system for reducing recognition complexity. Scalable recognition can be combined with scalable compression in a distributed speech recognition (DSR) application to reduce both the computational load and the bandwidth requirement at the server. A low complexity preprocessor is used to eliminate the unlikely classes so that the complex recognizer can use the redu...

متن کامل

Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches

The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph betw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Computer Architecture Letters

سال: 2022

ISSN: ['2473-2575', '1556-6056', '1556-6064']

DOI: https://doi.org/10.1109/lca.2022.3177419